Optimisation d'emplois du temps par recuit simulé. Algorithmique des algèbres de Lie libres = Timetable optimization by simulated annealing. Computations in free Lie algebrasAndary, Philippe; Krob, Daniel.1996, 165 p.Thesis

STACS 98 : 15th annual symposium on theoretical aspects of computer science (Paris, 25-27 February 1998)Morvan, Michel; Meinel, Christoph; Krob, Daniel et al.Lecture notes in computer science. 1998, issn 0302-9743, isbn 3-540-64230-7, XV, 630 p, isbn 3-540-64230-7Conference Proceedings

Lower bounds for randomized read-k-times branching programsSAUERHOFF, M.Lecture notes in computer science. 1998, pp 105-115, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Allocation de Ressources Radio dans les Réseaux Cellulaires = Radio Resource Assignment in Cellular NetworkLe Bris, Loïc; Krob, Daniel.1999, 175 p.Thesis

On Batcher's merge sorts as parallel sorting algorithmsRÜB, C.Lecture notes in computer science. 1998, pp 410-420, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Axiomatizing the equational theory of regular tree languagesESIK, Z.Lecture notes in computer science. 1998, pp 455-465, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Hierarchies of principal twist-closed triosJANTZEN, M.Lecture notes in computer science. 1998, pp 344-355, issn 0302-9743, isbn 3-540-64230-7Conference Paper

On the existence of polynomial time approximation schemes for OBDD minimizationSIELING, D.Lecture notes in computer science. 1998, pp 205-215, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Radix representations of algebraic number fields and finite automataSAFER, T.Lecture notes in computer science. 1998, pp 356-365, issn 0302-9743, isbn 3-540-64230-7Conference Paper

On the expected number of nodes at level k in 0-balanced treesKEMP, R.Lecture notes in computer science. 1998, pp 566-576, issn 0302-9743, isbn 3-540-64230-7Conference Paper

On the structure of Valiant's complexity classesBÜRGISSER, P.Lecture notes in computer science. 1998, pp 194-204, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Combinatoire des tableaux et des rubans = Combinatorics on tableaux and ribbon tableauxNovelli, Jean-Christophe; Krob, Daniel.1999, 230 p.Thesis

Floats, integers, and single source shortest pathsTHORUP, M.Lecture notes in computer science. 1998, pp 14-24, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Languages defined with modular counting quantifiersSTRAUBING, H.Lecture notes in computer science. 1998, pp 332-343, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Minimum spanning trees for minor-closed graph classes in parallelGUSTEDT, J.Lecture notes in computer science. 1998, pp 421-431, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Recognizability equals Monadic second-order definability for sets of graphs of bounded tree-widthLAPOIRE, D.Lecture notes in computer science. 1998, pp 618-628, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Shuffle of ω-words : Algebraic aspectsMATEESCU, A.Lecture notes in computer science. 1998, pp 150-160, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Provable security for block ciphers by decorrelationVAUDENAY, S.Lecture notes in computer science. 1998, pp 249-275, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Sorting and searching on the word RAMHAGERUP, T.Lecture notes in computer science. 1998, pp 366-398, issn 0302-9743, isbn 3-540-64230-7Conference Paper

The mutual exclusion scheduling problem for permutation and comparability graphsJANSEN, K.Lecture notes in computer science. 1998, pp 287-297, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Expressions K-rationnellesKrob, Daniel; Perrin, Dominique.1988, 301 p.Thesis

Complexité des systèmes d'information : une famille de mesures de la complexité scalaire d'un schéma d'architectureCASEAU, Yves; KROB, Daniel; PEYRONNET, Sylvain et al.Génie logiciel (1995). 2007, Num 82, pp 23-30, issn 1265-1397, 8 p.Article

Expressive completeness of LTrL on finite traces : An algebraic proofMEYER, R; PETIT, A.Lecture notes in computer science. 1998, pp 533-543, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Inducing an order on cellular automata by a grouping operationMAZOYER, J; RAPAPORT, I.Lecture notes in computer science. 1998, pp 116-127, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Unary quantifiers, transitive closure, and relations of large degreeLIBKIN, L; WONG, L.Lecture notes in computer science. 1998, pp 183-193, issn 0302-9743, isbn 3-540-64230-7Conference Paper